Deadlock-Free Information Structure Distributed Mutual Exclusion Algorithms
نویسندگان
چکیده
In the distributed mutual exclusion problem, a set of processes must coordinate their actions so that at any time at most one process may be within its critical section. Information structure distributed mutual exclusion algorithms (ISDME) are instances of a general algorithm which can represent several non-token-based algorithms. This paper introduces a new deadlock-free ISDME algorithm (DF-ISDME) which operates on a restricted class of information structures. DF-ISDME allows deadlock-free solutions for a wider class of information structure topologies than a previously identified class of deadlock-free Maekawa algorithms (DF-Maekawa), but retains the same throughput as DF-Maekawa. The paper provides a detailed description of the DF-ISDME algorithm, and correctness proofs. Message performance of the new algorithm is discussed, as are potential application scenarios.
منابع مشابه
A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion
Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3 and 5 , where n is the size of under...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Simulation Study on Distributed Mutual Exclusion
In the problem of mutual exclusion concurrent access to a shared resource using a struc tural program abstraction called a Critical Section CS must be synchronized such that at any time only one process can enter the CS In a distributed system due to the lack of both a shared memory and a global clock and due to unpredictable message delay the design of a distributed mutual exclusion algorithm ...
متن کاملOn Distributed Dynamic Channel Allocation in Mobile Cellular Networks
Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem (because a channel may be reused in different cells). In this paper, we establish the exact relationship between the two problems. Specifically, we introduce the problem of relaxed mu...
متن کاملAn Eecient Token-based Algorithm for Distributed Mutual Exclusion
In this paper, we present an eecient token-based algorithm for distributed mutual exclusion. The algorithm uses a distributed queue, which is not necessarily FIFO, to enqueue the request messages of the nodes for entry into the critical section (CS). These request messages are timestamped using roughly synchronized clocks. On the average, the algorithm requires 2 to 3 number of messages per cri...
متن کامل